#include <iostream>
#include<cstdio>
#include <algorithm>
#define F(i,a,b) for (int i=a;i<=b;i++)
using namespace std;

int x[701], y[701], n;
double a[701];

int main()
{
	while ( scanf("%d", &n) && n !=0 )
	{
		F(i,1,n)
			scanf("%d%d", &x[i], &y[i]);

		int Max = 0;
		F(i,1,n)
		{
			int t = 0;
			F(j,1,n)
			{
				if (i == j)
					continue;
				if ( x[i] == x[j] )
					a[++t] = 9999999;
				else
					a[++t] = ((double)y[j] - y[i] )/(x[j] - x[i]) ;
			}
			sort(&a[1], &a[t+1]);
			int now=1;
			F(j,2, n)
			{
				if (a[j] == a[j-1] )
					now++;
				else
				{
					Max = Max > now ? Max : now ;
					now = 1;
				}
			}
		}
		printf("%d\n", Max+1);
	}

	return 0;
}
